Efficient interpolators and filter banks using multiplier blocks
نویسندگان
چکیده
We examine the use of efficient shift-and-add multiplier structures and multiplier blocks to reduce computational complexity in filter banks. This is more efficient than treating each bank filter separately. We also examine the Farrow structure, which is used in interpolators. Applying multiplier blocks makes this structure cheaper than the more recognized Lagrange interpolator.
منابع مشابه
Multiplier-free Lagrange interpolators for oversampled D/A converters
This paper presents a novel approach to implement the interpolation function by means of Lagrange interpolators. The proposed architecture does not require high-frequency multipliers. With respect to conventional sinc filters of a comparable order, the response of Lagrange interpolators is better both in the passband and in the stopband, while the proposed implementation requires only a small i...
متن کاملDesign and implementation of a Multiplier-Less VLSI Architecture using Wavelet Filter Banks
Wavelet based signal processing incorporating Hilbert transform pair is proved to be more efficient by many authors. The multiplier-less VLSI based architecture of wavelet filter bank for biomedical applications is being proposed in this project. The proposed architecture reduces the computational complexity and improves the performance by combining DWT, Hilbert transform and sampling. Multipli...
متن کاملAn Efficient Algorithm to Design Nearly Perfect-Reconstruction Two-Channel Quadrature Mirror Filter Banks
In this paper, a novel technique for the design of two-channel Quadrature Mirror Filter (QMF) banks with linear phase in frequency domain is presented. To satisfy the exact reconstruction condition of the filter bank, low-pass prototype filter response in pass-band, transition band and stop band is optimized using unconstrained indirect update optimization method. The objective function is form...
متن کاملAn Efficient LUT Design on FPGA for Memory-Based Multiplication
An efficient Lookup Table (LUT) design for memory-based multiplier is proposed. This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...
متن کاملMultiplier-less IIR filter synthesis algorithms to trade-off the delay and the number of adders
As the complexity of digital filters is dominated by the nuniber of multiplications, many works have focused on minimizing the complexity of multiplier blocks that compute the constant coefficient niultiplications required in filters. Although the complexity of multiplier blocks is significantly reduced by using efficient techniques such as decomposing multiplications into simple operations and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 48 شماره
صفحات -
تاریخ انتشار 2000